#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int n,t,res;
    vector<int> odd,even;
    cin>>n;
    res=0;
    while(n--)
    {
        cin>>t;
        if(t&1) odd.push_back(t);
        else even.push_back(t);
    }
    sort(odd.begin(),odd.end());
    //sort(even.begin(),even.end());
    for(int i=0;i<odd.size();i++) res+=odd[i];
    if(res%2==0&&!odd.empty()) res-=odd[0];
    if(res)
    {
        for(int i=0;i<even.size();i++) res+=even[i];
    }
    cout<<res<<endl;
    return 0;
}
